A Column-consistent Biclustering Algorithm
نویسندگان
چکیده
Molecular structure and Function program, Hospital for Sick Children, 555 University Avenue, Toronto ON, Canada M5G 1X8. Terrence Donnelly Centre for Cellular & Biomolecular Research (Donnelly CCBR), 160 College Street, Room 930 Toronto, Ontario Canada, ON M5S 3E1. Department of Molecular Genetics and Department of Biochemistry, University of Toronto, 1 Kings College Circle, Toronto ON, Canada M5S 1A8
منابع مشابه
A New Strategy of Geometrical Biclustering for Microarray Data Analysis
In this paper, we present a new biclustering algorithm to provide the geometrical interpretation of similar microarray gene expression profiles. Different from standard clustering analyses, biclustering methodology can perform simultaneous classification on the row and column dimensions of a data matrix. The main object of the strategy is to reveal the submatrix, in which a subset of genes exhi...
متن کاملBiBinConvmean : A Novel Biclustering Algorithm for Binary Microarray Data
In this paper, we present a new algorithm called, BiBinConvmean, for biclustering of binary microarray data. It is a novel alternative to extract biclusters from sparse binary datasets. Our algorithm is based on Iterative Row and Column Clustering Combination (IRCCC) and Divide and Conquer (DC) approaches, K-means initialization and the CroBin evaluation function [6]. Applied on binary syntheti...
متن کاملRecent patents on biclustering algorithms for gene expression data analysis.
In DNA microarray experiments, discovering groups of genes that share similar transcriptional characteristics is instrumental in functional annotation, tissue classification and motif identification. However, in many situations a subset of genes only exhibits a consistent pattern over a subset of conditions. Although used extensively in gene expression data analysis, conventional clustering alg...
متن کاملDNA Microarray Data Analysis: A Novel Biclustering Algorithm Approach
Biclustering algorithms refer to a distinct class of clustering algorithms that perform simultaneous row-column clustering. Biclustering problems arise in DNAmicroarray data analysis, collaborative filtering, market research, information retrieval, text mining, electoral trends, exchange analysis, and so forth. When dealing with DNA microarray experimental data for example, the goal of bicluste...
متن کاملAn Approximation Ratio for Biclustering
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters is as uniform as possible. In this paper we approximate the optimal biclustering by applying one-way clustering algorithms independently on the rows and on the columns of the input matrix. We show that such a solution ...
متن کامل